Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search for Solving the Balanced Location Problem
In this paper we propose a general variable neighborhood search approach for the balanced location problem. Next to large shaking neighborhoods, the embedded variable neighborhood descent utilizes three neighborhood structures that focus on different solution aspects. By a computational study, we show that this VNS outperforms existing methods with respect to average solution quality and stabil...
متن کاملVariable Neighborhood Search for Attribute Reduction in Rough Set Theory
Attribute reduction is a combinational optimization problem in data mining domain that aims to find a minimal subset from a large set of attributes. The typical high dimensionality of datasets precludes the use of greedy methods to find reducts because of its poor adaptability, and requires the use of stochastic methods. Variable Neighborhood Search (VNS) is a recent metaheuristic and have been...
متن کاملA Variable Neighborhood Search for Solving the Linear Ordering Problem
A Systematic change of Neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization. In this paper we present a Variable Neighborhood Search implementation designed to find high quality solutions for the NP-hard Linear Ordering Problem, which has a significant number of application in practice, such triang...
متن کاملVariable Neighborhood Search for solving Bandwidth Coloring Problem
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an incre...
متن کاملSolving the p-Center problem with Tabu Search and Variable Neighborhood Search
The p-Center problem consists of locating p facilities and assigning clients to them in order to minimize the maximum distance between a client and the facility to which he or she is allocated. In this paper, we present a basic Variable Neighborhood Search and two Tabu Search heuristics for the p-Center problem without the triangle inequality. Both proposed methods use the 1-interchange (or ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1909875d